A Survey on Subgraph Counting

Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as motifs and graphlet-based metrics, which have been widely used to categorize compare networks from multiple domains. Counting subgraphs is, however, computationally very expensive, there has large body work on efficient algorithms strategies make counting feasible for larger networks. This survey aims precisely provide comprehensive overview existing methods counting. Our main contribution general structured review algorithms, classifying them set key characteristics, highlighting their similarities differences. We identify describe conceptual approaches, giving insight advantages limitations, we pointers implementations. initially focus exact sequential but also do thorough approximate methodologies (with trade-off between accuracy execution time) parallel (that need deal with an unbalanced search space).